Intersection-number Operators for Curves on Discs Ii
نویسندگان
چکیده
Let the braid group Bn act as (isotopy classes of) diffeomorphisms of an n-punctured disc Dn. Then there is an action of Bn on a polynomial algebra R = C [a1 , . . . , aN ] and a way of representing simple closed curves on Dn as elements of R. Fix k ∈ 2N. Using this approach we show that the image in Aut(R) of each Dehn twist τ about a simple closed γ in Dn satisfies a kind of characteristic equation when its action is restricted to the image in R of the set of curves γ having geometric intersection number k with γ. AMS Classification: 57M50.
منابع مشابه
Some lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملOn the Intersection of Acm Curves in P
Bezout’s theorem gives us the degree of intersection of two properly intersecting projective varieties. As two curves in P never intersect properly, Bezout’s theorem cannot be directly used to bound the number of intersection points of such curves. In this work, we bound the maximum number of intersection points of two integral ACM curves in P. The bound that we give is in many cases optimal as...
متن کاملOn the Arithmetic Self-intersection Number of the Dualizing Sheaf on Arithmetic Surfaces
We study the arithmetic self-intersection number of the dualizing sheaf on arithmetic surfaces with respect to morphisms of a particular kind. We obtain upper bounds for the arithmetic self-intersection number of the dualizing sheaf on minimal regular models of the modular curves associated with congruence subgroups Γ0(N) with square free level, as well as for the modular curves X(N) and the Fe...
متن کاملThe Speeds of Families of Intersection Graphs
A fundamental question of graph theory lies in counting the number of graphs which satisfy certain properties. In particular, the structure of intersection graphs of planar curves is unknown, and Schaefer, Sedgwick, and Štefankovič have shown that recognizing such graphs is NP-complete. As such, the number of intersection graphs of planar curves poses an interesting problem. Pach and Tóth have ...
متن کاملNote on the number of edges in families with linear union-complexity
We give a simple argument showing that the number of edges in the intersection graph G of a family of n sets in the plane with a linear unioncomplexity is O(ω(G)n). In particular, we prove χ(G) 6 col(G) < 19ω(G) for intersection graph G of a family of pseudo-discs, which improves a previous
متن کامل